Direct construction of code loops
نویسنده
چکیده
Code loops were introduced by R. L. Griess. Griess [5] and Hsu [7] gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods used some kind of induction. In this paper, we present a global construction of the loop, where we apply the correspondance between the concepts of Moufang loops and groups with triality.
منابع مشابه
Combinatorial Aspects of Code Loops
The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T.Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E....
متن کاملCombinatorial polarization, code loops, and codes of high level
We first find the combinatorial degree of any map f : V → F where F is a finite field and V is a finite-dimensional vector space over F . We then simplify and generalize a certain construction due to Chein and Goodaire that was used in characterizing code loops as finite Moufang loops that posses at most two squares. The construction yields binary codes of high divisibility level with prescribe...
متن کاملJa n 20 07 COMBINATORIAL ASPECTS OF CODE LOOPS
The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T.Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E....
متن کاملLoop Distribution and Fusion with Timing and Code Size Optimization for Embedded DSPs
Loop distribution and loop fusion are two effective loop transformation techniques to optimize the execution of the programs in DSP applications. In this paper, we propose a new technique combining loop distribution with direct loop fusion, which will improve the timing performance without jeopardizing the code size. We first develop the loop distribution theorems that state the legality condit...
متن کاملT Direct Gf N
A T -Direct code is defined as the set of T F -ary linear codes Γ1,Γ2, . . . ,ΓT such that Γi ∩ Γi = {0}, where Γi = Γ1 ⊕ Γ2⊕ · · · ⊕ Γi−1⊕ Γi+1 ⊕ · · · ⊕ ΓT is the dual of Γi with respect to the direct sum Λ = Γ1 ⊕ Γ2⊕ · · · ⊕ ΓT for each i = 1, 2, . . . , T . In this paper, a construction to a class of T -Direct codes with the constituent codes from the class of 2-Cyclic Maximum Rank Distance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008